Approximating the maximum consecutive subsums of a sequence
نویسندگان
چکیده
Dedicated to Professor Gad M. Landau, on the occasion of his 60th birthday
منابع مشابه
Searching for a superlinear lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution
Given a sequence of n numbers, theMaximum Consecutive Subsums Problem(MCSP) asks for the maximum consecutive sum of lengths l for each l = 1, . . . , n. No algorithm is known for this problem which is significantly better than the naive quadratic solution. Nor a super linear lower bound is known. The best known bound for the MCSP is based on the the computation of the (min,+)-convolution, anoth...
متن کاملNear Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence
We present a novel approach for computing all maximum consecutive subsums in a sequence of positive integers in near linear time. Solutions for this problem over binary sequences can be used for reporting existence (and possibly one occurrence) of Parikh vectors in a bit string. Recently, several attempts have been tried to build indexes for all Parikh vectors of a binary string in subquadratic...
متن کاملInvestigation of Consecutive Separating Arrangements of Bio active Compounds from Black Tea (Camellia sinensis) Residue
Every year lots of black tea (Camellia sinensis (L.) Kuntze) residue will produce in the factories. These residue are unusable whereas the bio active compounds can be extracted and used in the drag and food industries. Due to mentioned problems, this project was conducted years 2011 - 2012 with the aim to make a study on consecutive isolation of all bio active compounds from tea residu...
متن کاملOptimum Aggregate Inventory for Scheduling Multi-product Single Machine System with Zero Setup Time
In this paper we adopt the common cycle approach to economic lot scheduling problem and minimize the maximum aggregate inventory. We allow the occurrence of the idle times between any two consecutive products and consider limited capital for investment in inventory. We assume the setup times are negligible. To achieve the optimal investment in inventory we first find the idle times which minimi...
متن کاملA Forward-Backward Projection Algorithm for Approximating of the Zero of the Sum of Two Operators
In this paper, a forward-backward projection algorithm is considered for finding zero points of the sum of two operators in Hilbert spaces. The sequence generated by algorithm converges strongly to the zero point of the sum of an $alpha$-inverse strongly monotone operator and a maximal monotone operator. We apply the result for solving the variational inequality problem, fixed po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 525 شماره
صفحات -
تاریخ انتشار 2014